Convexity of hesitant fuzzy sets based on aggregation functions

Convexity is one of the most important geometric properties sets and a useful concept in many fields mathematics, like optimization. As there are also applications making use fuzzy optimization, it obvious that studies convexity frequent. In this paper we have extended notion for hesitant order to fulfill some necessary properties. Namely, found an appropriate definition on any ordered universe based aggregation functions such compatible with intersection, is, intersection two convex set fulfills cutworthy property.